SPATIAL KNOWLEDGE EXTRACTION FROM GEOGRAPHICAL DATABASES An approach based on the Controlled English Query Language Geo-Q and Conceptual Graphs

نویسنده

  • Marinos KAVOURAS
چکیده

Conceptualizing spatial relations through natural language seems to be closer to the model humans adopt for spatial reasoning. Controlled languages, which are subsets of natural ones, could be used in order to overcome the difficulties that emanate from the required experience in programming languages. In this paper, we propose a methodology in which questions are expressed in a new controlled query language called Geo-Q, for the purpose of extracting spatial knowledge from geographical databases. In the first step of the methodology, the question is parsed and a direct correspondence between the components of the question formulated in Geo-Q and the concepts/relations which constitute a Conceptual Query Graph is established. In the second step, the resulting Conceptual Query Graph is adequately transformed to an SQL query and the execution of the SQL query finally leads to the answer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulations of Graphs with a Visual Query Language: Application to a Geographical Information System

Operators for geographical databases can be classified into two categories: thematic-oriented operators and network-oriented operators. Thematic-oriented operators are based on geometric representations (e.g., intersection, inclusion, adjacency). Network-oriented operators are based on graph manipulations whatever the geometric representation is (e.g., a transitive closure of a graph). In this ...

متن کامل

Constraint relaxation of the polygon-polyline topological relation for geographic pictorial query languages

This work addresses the problem of relaxing spatial constraints for pictorial queries having null answers in geographical databases. It focuses on the polygon-polyline topological relationship and proposes a computational model which is based on the notions of Operator Conceptual Neighborhood (OCN) graph and the relative 16-intersection matrix. The former is addressed to represent the conceptua...

متن کامل

RAPPORT DE RECHERCHE On Querying Simple Conceptual Graphs With Negation

We consider basic conceptual graphs, namely simple conceptual graphs (SGs), which are equivalent to the existential conjunctive positive fragment of first-order logic. The fundamental problem, deduction, is performed by a graph homomorphism, called projection. The existence of a projection from a SG Q to a SG G means that the knowledge represented by Q is deducible from the knowledge represente...

متن کامل

On querying simple conceptual graphs with negation

We consider basic conceptual graphs, namely simple conceptual graphs (SGs), which are equivalent to the existential conjunctive positive fragment of first-order logic. The fundamental problem, deduction, is performed by a graph homomorphism called projection. The existence of a projection from a SG Q to a SG Gmeans that the knowledge represented by Q is deducible from the knowledge represented ...

متن کامل

The Problem of English Spatial, Non-spatial and Idiomatic Adpositions in Iranian EFL Environment: A Prototypical Approach

Several studies of L2 learners’ interlanguage have addressed the complexity of the English adpositional system due to several reasons like L1 transfer, lack of knowledge in L2 and the strong collocational relations of prepositions with other elements of the English language. The major purpose of the present study is to evaluate the performance of Iranian students in dealing with three broad cat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005